Description: 此源代码是用遗传算法解决旅行商问题的经典实例，很有借鉴意义-This source code is a genetic algorithm to solve the classic traveling salesman problem instances of referential significance to Platform: |
Size: 4096 |
Author:张媛 |
Hits:
Description: TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -TSP dynamic programming to solve the problem. Description of the problem: traveling salesman problem, namely TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel businessmen to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum. Platform: |
Size: 1045504 |
Author:黄艺敏 |
Hits:
Description: lingo 多旅行商问题的求解代码
每人限制运货为50-multi-lingo code for solving the traveling salesman problem restricted shipments of 50 per person Platform: |
Size: 1024 |
Author:phoebe |
Hits:
Description: TSP问题,即旅行商问题,matlab环境下可以运行-TSP problem, that is, traveling salesman problem, matlab environment can run Platform: |
Size: 59392 |
Author:刘琴 |
Hits:
Description: 用A星算法解决旅行商（货郎担）问题，附设计报告和测试用例-A Star algorithm used to solve TSP (traveling salesman) problems, with the design of reports and test cases Platform: |
Size: 60416 |
Author:杨猛 |
Hits:
Description: 遗传算法解旅行商问题 （工程须运行在VS2008下）-Genetic Algorithm for Traveling Salesman Problem [Works have to run in VS2008 under] Platform: |
Size: 22528 |
Author:sunset |
Hits:
Description: 遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。-Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process. Platform: |
Size: 504832 |
Author:竹子的信仰 |
Hits:
Description: 多旅行商问题(Multiple Traveling Salesperson Problem ,简称MTSP) 讨论的是如何安排m( > 1 ) 位旅行商访问n( >
m ) 座城市,要求每个城市只允许被访问一次时,求解所有旅行商花费的费用和是最小(或最大) 的问题。MTSP 问题其实与单
旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条
件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。现
为解决MTSP 问题给出了一种新的染色体设计和相关的处理方法,并与以往的理论设计和计算性能进行比较。计算测试显
示,新的方法能够获得较小的查找空间,在许多方面,新的方法产生的解空间更好。-Multi-Traveling Salesman Problem (Multiple Traveling Salesperson Problem, referred to as MTSP) discussed the arrangements for the m (> 1)-bit traveling salesman visits n (>
m) cities to require each city to allow only visited once, the solution of traveling salesman to spend all the costs and the smallest (or largest) problems. In fact, with the single issue of MTSP
TSP (Traveling Salesperson Problem, referred to as TSP) is similar to, but added any city as long as the visit by a traveling salesman to be attached to the
Pieces, thus increasing the complexity of the problem. The use of genetic algorithms in the past (GA) to study and solve the issue of MTSP, usually a standard chromosome and the TSP approach. Is
MTSP problem to solve is given a new design and associated chromosome approach and the theory of the previous design and to compare performance. Calculation of the test significantly
Show that the new method can find a smaller space, in many respects, the new met Platform: |
Size: 247808 |
Author:liqiubin |
Hits:
Description: 旅行商问题的实现，用分支界限法实现旅行商问题-The realization of traveling salesman problem, and the Limits of Law branch of the realization of traveling salesman problem Platform: |
Size: 196608 |
Author:燃烧 |
Hits:
Description: 多旅行商问题是单旅行商问题的扩展, 具有更广泛的实际意义。在研究M TSP 解的特点的基础上, 提
出了最小化总行程和均分多个旅行商访问点数、最小化总行程及均分访问路程的两个多目标的M TSP 问题,
并分别给出了相应的数学模型、求解算法和应用实例, 实例表明模型的正确性。-Multi-traveling salesman problem traveling salesman problem is a single expansion, with a wider range of practical significance. M TSP in the study of the characteristics of solutions based on the smallest share of the total number of traveling salesman tour and visit the points, the smallest share of the total trip distance to visit more than two goals of the M TSP problem and were given the corresponding mathematical model, algorithm and application examples, examples show that the model is correct. Platform: |
Size: 242688 |
Author:Notics |
Hits:
Description: 遗传算法求解TSP问题的MATLAB实现。这是一篇非常有新意的论文，对于学习遗传算法非常有用-This paper has resolved the traveling salesman problem(TSP) by virtue of geneitc algorithms(GA) Platform: |
Size: 156672 |
Author:王斌 |
Hits:
Description: 老外写的论述TSP问题的各种算法及相关论述，可作研究用。-Written by foreigners of various algorithms discussed in TSP problem and the related discussion, can be used for research. Platform: |
Size: 387072 |
Author:xuhui |
Hits:
Description: 遗传算法求解旅行商问题。在n=20的情况下依然能90 以上获得正确解。-Genetic Algorithm for Traveling Salesman Problem. In the case of n = 20 can still obtain the correct solution for more than 90 . Platform: |
Size: 4096 |
Author:ocpocpocp |
Hits:
Search - traveling salesman problem